Multi-Scale Adaptive Connected Component Labeling for Binary Images
نویسندگان
چکیده
منابع مشابه
A New Framework for Connected Components Labeling of Binary Images
Given a binary image of n pixels, assign integral labels to all pixels so that any background pixel has label 0 and any two foreground pixels have the same positive integral labels, if and only if they belong to the same connected components. This problem is referred to as ’Connected Components Labeling’ and it is one of the most fundamental problems in image processing and analysis. This paper...
متن کاملConnected Component Labeling Algorithms for Gray-Scale Images and Evaluation of Performance using Digital Mammograms
The main goal of this paper is to compare performance of connected component labeling algorithms on grayscale digital mammograms. This study was carried out as a part of a research for improving efficiency and accuracy of diagnosing breast cancer using digital mammograms. Three connected component labeling algorithms developed by Jung-Me Park [8], Kenji Suzuki [16] and Kesheng Wu [9], were used...
متن کاملBlock-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...
متن کاملFast connected-component labeling
Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008
متن کاملOptimizing Connected Component Labeling Algorithms
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2019
ISSN: 2475-8841
DOI: 10.12783/dtcse/iciti2018/29135